TSTP Solution File: ITP080^1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : ITP080^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.fIfZ7KGI5s true
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 05:22:03 EDT 2023
% Result : Theorem 0.60s 1.07s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 33
% Syntax : Number of formulae : 56 ( 8 unt; 27 typ; 0 def)
% Number of atoms : 79 ( 9 equ; 2 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 256 ( 10 ~; 4 |; 0 &; 215 @)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 9 avg)
% Number of types : 10 ( 9 usr)
% Number of type conns : 47 ( 47 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 18 usr; 7 con; 0-7 aty)
% ( 14 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 46 ( 14 ^; 32 !; 0 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(node_type,type,
node: $tType ).
thf(g_type,type,
g: $tType ).
thf(val_type,type,
val: $tType ).
thf(set_node_type,type,
set_node: $tType ).
thf(list_node_type,type,
list_node: $tType ).
thf(list_P561207620_edgeD_type,type,
list_P561207620_edgeD: $tType ).
thf(member_node_type,type,
member_node: node > set_node > $o ).
thf(set_val_type,type,
set_val: $tType ).
thf(tl_node_type,type,
tl_node: list_node > list_node ).
thf(produc1432036078de_val_type,type,
produc1432036078de_val: $tType ).
thf(graph_1012773594_edgeD_type,type,
graph_1012773594_edgeD: ( g > list_node ) > ( g > $o ) > ( g > node > list_P561207620_edgeD ) > g > node > list_node > node > $o ).
thf(alpha_n_type,type,
alpha_n: g > list_node ).
thf(defs_type,type,
defs: g > node > set_val ).
thf(inEdges_type,type,
inEdges: g > node > list_P561207620_edgeD ).
thf(sSA_CF551432799de_val_type,type,
sSA_CF551432799de_val: ( g > list_node ) > ( g > node > set_val ) > ( g > produc1432036078de_val > option_list_val ) > g > val > node ).
thf(rs_type,type,
rs: list_node ).
thf(option_list_val_type,type,
option_list_val: $tType ).
thf(g2_type,type,
g2: g ).
thf(hd_node_type,type,
hd_node: list_node > node ).
thf(invar_type,type,
invar: g > $o ).
thf(set_node2_type,type,
set_node2: list_node > set_node ).
thf(entry_type,type,
entry: g > node ).
thf(r_type,type,
r: val ).
thf(distinct_node_type,type,
distinct_node: list_node > $o ).
thf(pred_phi_r_type,type,
pred_phi_r: node ).
thf(graph_1994935542_edgeD_type,type,
graph_1994935542_edgeD: ( g > list_node ) > ( g > $o ) > ( g > node > list_P561207620_edgeD ) > ( g > node ) > g > list_node > $o ).
thf(phis_type,type,
phis: g > produc1432036078de_val > option_list_val ).
thf(conj_0,conjecture,
~ ( member_node @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ ( set_node2 @ ( tl_node @ rs ) ) ) ).
thf(zf_stmt_0,negated_conjecture,
member_node @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ ( set_node2 @ ( tl_node @ rs ) ),
inference('cnf.neg',[status(esa)],[conj_0]) ).
thf(zip_derived_cl351,plain,
member_node @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ ( set_node2 @ ( tl_node @ rs ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(fact_4_rs_H__props_I1_J,axiom,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ rs @ pred_phi_r ).
thf(zip_derived_cl4,plain,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ rs @ pred_phi_r,
inference(cnf,[status(esa)],[fact_4_rs_H__props_I1_J]) ).
thf(fact_0_old_Opath2__hd,axiom,
! [G: g,N: node,Ns: list_node,M: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ G @ N @ Ns @ M )
=> ( N
= ( hd_node @ Ns ) ) ) ).
thf(zip_derived_cl0,plain,
( !!
@ ^ [Y0: g] :
( !!
@ ^ [Y1: node] :
( !!
@ ^ [Y2: list_node] :
( !!
@ ^ [Y3: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ Y0 @ Y1 @ Y2 @ Y3 )
=> ( Y1
= ( hd_node @ Y2 ) ) ) ) ) ) ),
inference(cnf,[status(esa)],[fact_0_old_Opath2__hd]) ).
thf(zip_derived_cl358,plain,
! [X2: g] :
( !!
@ ^ [Y0: node] :
( !!
@ ^ [Y1: list_node] :
( !!
@ ^ [Y2: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X2 @ Y0 @ Y1 @ Y2 )
=> ( Y0
= ( hd_node @ Y1 ) ) ) ) ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl0]) ).
thf(zip_derived_cl359,plain,
! [X2: g,X4: node] :
( !!
@ ^ [Y0: list_node] :
( !!
@ ^ [Y1: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X2 @ X4 @ Y0 @ Y1 )
=> ( X4
= ( hd_node @ Y0 ) ) ) ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl358]) ).
thf(zip_derived_cl360,plain,
! [X2: g,X4: node,X6: list_node] :
( !!
@ ^ [Y0: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X2 @ X4 @ X6 @ Y0 )
=> ( X4
= ( hd_node @ X6 ) ) ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl359]) ).
thf(zip_derived_cl361,plain,
! [X2: g,X4: node,X6: list_node,X8: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X2 @ X4 @ X6 @ X8 )
=> ( X4
= ( hd_node @ X6 ) ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl360]) ).
thf(zip_derived_cl362,plain,
! [X2: g,X4: node,X6: list_node,X8: node] :
( ~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X2 @ X4 @ X6 @ X8 )
| ( X4
= ( hd_node @ X6 ) ) ),
inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl361]) ).
thf(zip_derived_cl363,plain,
! [X2: g,X4: node,X6: list_node,X8: node] :
( ~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X2 @ X4 @ X6 @ X8 )
| ( X4
= ( hd_node @ X6 ) ) ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl362]) ).
thf(zip_derived_cl372,plain,
( ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r )
= ( hd_node @ rs ) ),
inference('sup-',[status(thm)],[zip_derived_cl4,zip_derived_cl363]) ).
thf(zip_derived_cl377,plain,
member_node @ ( hd_node @ rs ) @ ( set_node2 @ ( tl_node @ rs ) ),
inference(demod,[status(thm)],[zip_derived_cl351,zip_derived_cl372]) ).
thf(fact_30_FormalSSA__Misc_Odistinct__hd__tl,axiom,
! [Xs: list_node] :
( ( distinct_node @ Xs )
=> ~ ( member_node @ ( hd_node @ Xs ) @ ( set_node2 @ ( tl_node @ Xs ) ) ) ) ).
thf(zip_derived_cl30,plain,
( !!
@ ^ [Y0: list_node] :
( ( distinct_node @ Y0 )
=> ( (~) @ ( member_node @ ( hd_node @ Y0 ) @ ( set_node2 @ ( tl_node @ Y0 ) ) ) ) ) ),
inference(cnf,[status(esa)],[fact_30_FormalSSA__Misc_Odistinct__hd__tl]) ).
thf(zip_derived_cl751,plain,
! [X2: list_node] :
( ( distinct_node @ X2 )
=> ( (~) @ ( member_node @ ( hd_node @ X2 ) @ ( set_node2 @ ( tl_node @ X2 ) ) ) ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl30]) ).
thf(zip_derived_cl752,plain,
! [X2: list_node] :
( ~ ( distinct_node @ X2 )
| ~ ( member_node @ ( hd_node @ X2 ) @ ( set_node2 @ ( tl_node @ X2 ) ) ) ),
inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl751]) ).
thf(zip_derived_cl761,plain,
~ ( distinct_node @ rs ),
inference('sup-',[status(thm)],[zip_derived_cl377,zip_derived_cl752]) ).
thf(fact_5_old_OEntryPath__distinct,axiom,
! [G: g,Ns: list_node] :
( ( graph_1994935542_edgeD @ alpha_n @ invar @ inEdges @ entry @ G @ Ns )
=> ( distinct_node @ Ns ) ) ).
thf(zip_derived_cl5,plain,
( !!
@ ^ [Y0: g] :
( !!
@ ^ [Y1: list_node] :
( ( graph_1994935542_edgeD @ alpha_n @ invar @ inEdges @ entry @ Y0 @ Y1 )
=> ( distinct_node @ Y1 ) ) ) ),
inference(cnf,[status(esa)],[fact_5_old_OEntryPath__distinct]) ).
thf(zip_derived_cl400,plain,
! [X2: g] :
( !!
@ ^ [Y0: list_node] :
( ( graph_1994935542_edgeD @ alpha_n @ invar @ inEdges @ entry @ X2 @ Y0 )
=> ( distinct_node @ Y0 ) ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl5]) ).
thf(zip_derived_cl401,plain,
! [X2: g,X4: list_node] :
( ( graph_1994935542_edgeD @ alpha_n @ invar @ inEdges @ entry @ X2 @ X4 )
=> ( distinct_node @ X4 ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl400]) ).
thf(zip_derived_cl402,plain,
! [X2: g,X4: list_node] :
( ~ ( graph_1994935542_edgeD @ alpha_n @ invar @ inEdges @ entry @ X2 @ X4 )
| ( distinct_node @ X4 ) ),
inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl401]) ).
thf(fact_3_rs_H__props_I2_J,axiom,
graph_1994935542_edgeD @ alpha_n @ invar @ inEdges @ entry @ g2 @ rs ).
thf(zip_derived_cl3,plain,
graph_1994935542_edgeD @ alpha_n @ invar @ inEdges @ entry @ g2 @ rs,
inference(cnf,[status(esa)],[fact_3_rs_H__props_I2_J]) ).
thf(zip_derived_cl403,plain,
distinct_node @ rs,
inference('sup+',[status(thm)],[zip_derived_cl402,zip_derived_cl3]) ).
thf(zip_derived_cl766,plain,
$false,
inference(demod,[status(thm)],[zip_derived_cl761,zip_derived_cl403]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : ITP080^1 : TPTP v8.1.2. Released v7.5.0.
% 0.12/0.14 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.fIfZ7KGI5s true
% 0.14/0.36 % Computer : n023.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun Aug 27 16:02:11 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % Running portfolio for 300 s
% 0.14/0.36 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.36 % Number of cores: 8
% 0.14/0.36 % Python version: Python 3.6.8
% 0.14/0.36 % Running in HO mode
% 0.58/0.70 % Total configuration time : 828
% 0.58/0.70 % Estimated wc time : 1656
% 0.58/0.70 % Estimated cpu time (8 cpus) : 207.0
% 0.59/0.75 % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.59/0.75 % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.59/0.77 % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 0.59/0.77 % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 0.59/0.78 % /export/starexec/sandbox/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.59/0.78 % /export/starexec/sandbox/solver/bin/lams/40_noforms.sh running for 90s
% 0.59/0.79 % /export/starexec/sandbox/solver/bin/lams/40_b.comb.sh running for 70s
% 0.59/0.81 % /export/starexec/sandbox/solver/bin/lams/30_sp5.sh running for 60s
% 0.59/0.83 % /export/starexec/sandbox/solver/bin/lams/30_b.l.sh running for 90s
% 0.60/1.07 % Solved by lams/35_full_unif4.sh.
% 0.60/1.07 % done 98 iterations in 0.295s
% 0.60/1.07 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.60/1.07 % SZS output start Refutation
% See solution above
% 0.60/1.07
% 0.60/1.07
% 0.60/1.07 % Terminating...
% 4.36/1.22 % Runner terminated.
% 4.36/1.22 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------